One of the two techniques for communicating between parallel processes (the other being shared memory). A common use of message passing is for communication in a parallel computer. A process running on one processor may send a message to a process running on the same processor or another. The actual transmission of the message is usually handled by the run-time support of the language in which the processes are written, or by the operating system. Message passing scales better than shared memory, which is generally used in computers with relatively few processors. This is because the total communications bandwidth usually increases with the number of processors. A message passing system provides primitives for sending and receiving messages. These primitives may by either synchronous or asynchronous or both. A synchronous send will not complete (will not allow the sender to proceed) until the receiving process has received the message. This allows the sender to know whether the message was received successfully or not (like when you speak to someone on the telephone). An asynchronous send simply queues the message for transmission without waiting for it to be received (like posting a letter). A synchronous receive primitive will wait until there is a message to read whereas an asynchronous receive will return immediately, either with a message or to say that no message has arrived. Messages may be sent to a named process or to a named mailbox which may be readable by one or many processes. Transmission involves determining the location of the recipient and then choosing a route to reach that location. The message may be transmitted in one go or may be split into packets which are transmitted independently (e.g. using wormhole routing) and reassembled at the receiver. The message passing system must ensure that sufficient memory is available to buffer the message at its destination and at intermediate nodes. Messages may be typed or untyped at the programming language level. They may have a priority, allowing the receiver to read the highest priority messages first. Some message passing computers are the {MIT J-Machine (http://ai.mit.edu/projects/cva/cva_j_machine.html)}, the {Illinois Concert Project (http://www-csag.cs.uiuc.edu/projects/concert.html)} and transputer-based systems. Object-oriented programming uses message passing between objects as a metaphor for procedure call. (1994-11-11)

The bit is an item of a horse's tack. It usually refers to the assembly of components that contacts and controls the horse's mouth, and includes the shanks, rings, cheekpads and mullen, all described here below, but it also sometimes simply refers to the mullen, the piece that fits inside the horse's mouth.

Bit-length or bit width is the number of binary digits, called bits, necessary to represent an integer as a binary number. Formally, the bit-length of a natural number n>0 is a function, bitLength(n), of the binary logarithm of n:

A bit array (also known as bit map, bit set, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure.

<data> (LSB) Bit zero, the bit of a binary number giving the number of ones, the last or rightmost bit when the number is written in the usual way. (1995-07-13)

<programming, data> An ordered sequence of bits. This is very similar to a bit pattern except that the term "string" suggests an arbitrary length sequence as opposed to a pre-determined length "pattern".

(MSB) Bit n-1 in an n bit binary number, the bit with the greatest weight (2^(n-1)). The first or leftmost bit when the number is written in the usual way. (1995-07-13)

BIT Numerical Mathematics is a quarterly peer-reviewed mathematics journal that covers research in numerical analysis. It was established in 1961 by Carl Erik Fröberg and is published by Springer Science+Business Media.

[high-order bit] The most significant bit in a byte. See also meta bit, hobbit, dread high bit disease. [Jargon File]